Path based algorithms for metro network design
نویسندگان
چکیده
منابع مشابه
Path based algorithms for metro network design
This paper proposes a practical methodology for the problem of designing a metro configuration under two criteria: population coverage and construction cost. It is assumed that a set of corridors defining a rough a priori geometric configuration is provided by the planners. The proposed algorithm consists of fine tuning the location of single alignments within each corridor. This is achieved by...
متن کاملDesign of Storage Area Network Based on Metro WDM Networking
Storage Area Networks (SANs) have become an essential part of today’s enterprise computing. The paper reports the design of SANs based on metro Wavelength Division Multiplexing (WDM) networks technologies. It reviews related SAN technologies. It also presents analysis and simulation results of a proposed architecture. Throughput, delay and packet dropping probability results are presented under...
متن کاملTheory and Practice of Metro Network Design
Most transit networks are designed empirically. For bus networks this process 1s often satisfactory because bus routes and networks are very dependent on local conditions, and they can be easily modified, allowing easy corrections of problems which line design may cause in operations. However, with transit systems which have extensive infrastructure, most typically metro lines and networks, cor...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2015
ISSN: 0305-0548
DOI: 10.1016/j.cor.2015.04.007